Average case complexity for finite Boolean functions
نویسندگان
چکیده
منابع مشابه
Average case complexity of DNFs and Shannon semi-effect for narrow subclasses of boolean functions
In this paper we establish some bounds on the complexity of disjunctive normal forms of boolean function from narrow subclasses (e.g. functions takes value 0 in a limited number of points). The bounds are obtained by reduction the initial problem to a simple set covering problem. The nature of the complexity bounds provided is tightly connected with Shannon effect and semi-effect for this classes.
متن کاملMinimizing the Average Query Complexity of Learning Monotone Boolean Functions
This paper addresses the problem of completely reconstructing deterministic monotone Boolean functions via membership queries. The minimum average query complexity is guaranteed via recursion, where partially ordered sets (posets) make up the overlapping subproblems. For problems with up to 4 variables, the posets’ optimality conditions are summarized in the form of an evaluative criterion. The...
متن کاملDerandomization, hard functions, and average-case complexity
In this thesis we study questions related to the relative power of randomness in computation, and the connections between the existence of (explicit) hard functions on the average and hard functions in the worst-case. It is well known that these questions are closely related, and in fact, the following three statements are equivalent [19, 65]: 1. There exist a function (computable in exponentia...
متن کاملAn Average Case Time Complexity Estimator for Black-box Functions
Average case time complexity is widely used to evaluate the efficiency of an algorithm [2]. Given a blackbox function, if a tester wants to know the average case time complexity, he/she has to analyze the source code and make input assumption so as to know the average case of the function. Although that is feasible, it is time consuming and that makes the testing process no longer automatic. In...
متن کاملComplexity of Boolean Functions
s of Presentation: Paul Beame: Time-Space Tradeoffs and Multiparty Communication Complexity 9 Beate Bollig: Exponential Lower Bounds for Integer Multiplication Using Universal Hashing . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 9 Philipp Wölfel: On k-wise l-mixed Boolean Functions . . . . . . . . . . . . . . 10 Elizabeta Okol’nishnikova: On One Lower Bound for Branching Progra...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 2001
ISSN: 0166-218X
DOI: 10.1016/s0166-218x(00)00360-7